An Investigational Modeling Approach for Improving Gene Selection using Regularized Cox Regression Model
نویسندگان
چکیده
By producing the required proteins, process of gene expression establishes physical properties living things. Gene from DNA or RNA may be recorded using a variety approaches. Regression analysis has evolved in prominence area genetic research recently. Several genes high dimensional information for statistical inference not related to their illnesses, which is one major problems. The ability selection enhance outcomes several techniques been demonstrated. For censored survival data, Cox proportional hazards regression model most widely used model. In order identify important and achieve classification accuracy, new technique selecting tuning parameter suggested this study an optimization algorithm. According experimental findings, strategy performs much better than two rival methods terms under curve number chosen genes. This provides comprehensive assessment latest work on performance evaluation selection. addition its analysis, conducts thorough numerous efforts done various extended models based recent years.
منابع مشابه
SFLA Based Gene Selection Approach for Improving Cancer Classification Accuracy
In this paper, we propose a new gene selection algorithm based on Shuffled Frog Leaping Algorithm that is called SFLA-FS. The proposed algorithm is used for improving cancer classification accuracy. Most of the biological datasets such as cancer datasets have a large number of genes and few samples. However, most of these genes are not usable in some tasks for example in cancer classification....
متن کاملHigh - Dimensional Ising Model Selection Using 1 - Regularized Logistic Regression
We consider the problem of estimating the graph associated with a binary Ising Markov random field. We describe a method based on 1-regularized logistic regression, in which the neighborhood of any given node is estimated by performing logistic regression subject to an 1-constraint. The method is analyzed under high-dimensional scaling in which both the number of nodes p and maximum neighborhoo...
متن کاملHigh-Dimensional Graphical Model Selection Using ℓ1-Regularized Logistic Regression
We focus on the problem of estimating the graph structure associated with a discrete Markov random field. We describe a method based on `1regularized logistic regression, in which the neighborhood of any given node is estimated by performing logistic regression subject to an `1-constraint. Our framework applies to the high-dimensional setting, in which both the number of nodes p and maximum nei...
متن کاملHigh-Dimensional Graphical Model Selection Using l1-Regularized Logistic Regression
We consider the problem of estimating the graph structure associated with a discrete Markov random field. We describe a method based on l1-regularized logistic regression, in which the neighborhood of any given node is estimated by performing logistic regression subject to an l1-constraint. Our framework applies to the high-dimensional setting, in which both the number of nodes p and maximum ne...
متن کاملHigh-Dimensional Graphical Model Selection Using $\ell_1$-Regularized Logistic Regression
We focus on the problem of estimating the graph structure associated with a discrete Markov random field. We describe a method based on `1regularized logistic regression, in which the neighborhood of any given node is estimated by performing logistic regression subject to an `1-constraint. Our framework applies to the high-dimensional setting, in which both the number of nodes p and maximum nei...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Biology and Bioinformatics
سال: 2023
ISSN: ['1994-6538']
DOI: https://doi.org/10.17537/2023.18.282